Formal Program Development with Approximations
نویسندگان
چکیده
We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by resource bounds. Idealistic specifications are identified with the limits of sequences of more “realistic” specifications, and such sequences can then be refined in their entirety. Compromises amount to focusing the attention on a particular element of the sequence instead of the sequence as a whole. This method addresses the problem that initial formal specifications can be abstract or complete but rarely both. Various potential application areas are sketched, some illustrated with examples. Key research issues are found in identifying metric spaces and properties that make them usable for refinement using approximations.
منابع مشابه
Local cone approximations in optimization
Abstract: We show how to use intensively local cone approximations to obtain results in some fields of optimization theory such as optimality conditions, constraint qualifications, mean value theorems and error bound.
متن کاملUsing Semantic Approximations in Validation and Diagnosis of Constraint Logic Programs
During program development and debugging, several tools may be used which deal with (approximations of the) program semantics in one way or the other. Examples of such tools are automatic validation tools, declarative debuggers, program analyzers, etc. These tools also have in common that the semantics of the current program and the semantics of the intended program are often compared. In this ...
متن کاملA Formal Specification of Pointer Analysis Approximations
Exact pointer analysis is an intractable problem, so numerous pointer analysis algorithms have been developed that approximate the exact solution with varying levels of precision. These algorithms employ a variety of algorithmic strategies to describe how to approximate the exact solution. However, there is no formal description of the precision that these algorithms compute. This paper present...
متن کاملNew approximations for the cone of copositive matrices and its dual
We provide convergent hierarchies for the convex cone C of copositive matrices and its dual C∗, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner) approximations for C (resp. for its dual C∗), thus complementing previous inner (resp. outer) approximations for C (for C∗). In particular, both inner an...
متن کاملApproximate cone factorizations and lifts of polytopes
In this paper we show how to construct inner and outer convex approximations of a polytope from an approximate cone factorization of its slack matrix. This provides a robust generalization of the famous result of Yannakakis that polyhedral lifts of a polytope are controlled by (exact) nonnegative factorizations of its slack matrix. Our approximations behave well under polarity and have efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005